Determinants and ranks of random matrices over Zm
نویسندگان
چکیده
Let Zm be the ring of integers modulo m. The m-rank of an integer matrix is the largest order of a square submatrix whose determinant is not divisible by m. We determine the probability that a random rectangular matrix over Zm has a specified m-rank and, if it is square, a specified determinant. These results were previously known only for prime m. CommentsOnly the Abstract is given here. The full paper appeared as [1]. For related work on randomsymmetric matrices, see [2]. References[1] R. P. Brent and B. D. McKay, “Determinants and ranks of random matrices over Zm”, Discrete Mathematics66 (1987), 35–49. MR 88h:15042. Also appeared as “Determinants and ranks (mod m) of random integermatrices”, Report CMA-R25-85, CMA, ANU, August 1985, 17 pp. rpb094.[2] R. P. Brent and B. D. McKay, On determinants of random symmetric matrices over Zm, Ars Combinatoria26A (1988), 57–64. MR 90g:05015. Also appeared as Report TR-CS-88-03, CSL, ANU, February 1988, 8 pp.rpb101. (Brent) Centre for Mathematical Analysis, Australian National UniversityE-mail address: [email protected](McKay) Computer Science Department, Australian National UniversityE-mail address: [email protected] 1991 Mathematics Subject Classification. Primary 05A15, 15A52; Secondary 12C99, 15A03, 16A42, 16A44.
منابع مشابه
On Determinants of Random Symmetric Matrices over Zm
We determine the probability that a random n by n symmetric matrix over {1, 2, . . . ,m} has determinant divisible by m.
متن کاملComputing the Discriminants of Brauer's Centralizer Algebras
This paper discusses a computational problem arising in the study of the structure theory of Brauer's orthogonal and symplectic centralizer algebras. The problem is to compute the ranks of certain combinatorially defined matrices Zm k(x) (these matrices are presented in §2). This computation is difficult because the sizes of the matrices Zm k(x) are enormous even for small values of m and k . H...
متن کاملInversion of Circulant Matrices over Zm
In this paper we consider the problem of inverting an n × n circulant matrix with entries over Zm. We show that the algorithm for inverting circulants, based on the reduction to diagonal form by means of FFT, has some drawbacks when working over Zm. We present three different algorithms which do not use this approach. Our algorithms require different degrees of knowledge of m and n, and their c...
متن کاملDeterminants and permanents of Hessenberg matrices and generalized Lucas polynomials
In this paper, we give some determinantal and permanental representations of generalized Lucas polynomials, which are a general form of generalized bivariate Lucas p-polynomials, ordinary Lucas and Perrin sequences etc., by using various Hessenberg matrices. In addition, we show that determinant and permanent of these Hessenberg matrices can be obtained by using combinations. Then we show, the ...
متن کاملTan's Epsilon-Determinant and Ranks of Matrices over Semirings
We use the ϵ-determinant introduced by Ya-Jia Tan to define a family of ranks of matrices over certain semirings. We show that these ranks generalize some known rank functions over semirings such as the determinantal rank. We also show that this family of ranks satisfies the rank-sum and Sylvester inequalities. We classify all bijective linear maps which preserve these ranks.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 66 شماره
صفحات -
تاریخ انتشار 1987